Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel
نویسنده
چکیده
We propose to reduce the decoding complexity of polar codes with non-Arikan kernels by employing a (near) ML decoding algorithm for the codes generated by kernel rows. A generalization of the order statistics algorithm is presented for soft decoding of Reed-Solomon codes. Algebraic properties of the Reed-Solomon code are exploited to increase the reprocessing order. The obtained algorithm is used as a building block to obtain a decoder for polar codes with Reed-Solomon kernel.
منابع مشابه
Fast Encoding of Polar Codes With Reed-Solomon Kernel
A low-complexity systematic encoding algorithm for polar codes with Reed-Solomon kernel is presented. The proposed method relies on fast Fourier transform based ReedSolomon encoding techniques. Application of polar codes in storage systems is considered.
متن کاملSoft-decision decoding of polar codes with Reed-Solomon kernels
The problem of efficient soft-decision decoding of polar codes with ReedSolomon kernel is considered. A decomposition of the kernel based on the cyclotomic FFT algorithm is proposed, which enables one to implement near-optimal evaluation of log-likelihood ratios in the successive cancellation decoding algorithm.
متن کاملUsing concatenated algebraic geometry codes in channel polarization
Polar codes were introduced by Arikan [1] in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient successive cancellation decoding strategy. Recently, non-binary polar codes have been studied, in which one can use different algebraic geometry codes to...
متن کاملIterative Algebraic Soft Decision Decoding of Reed-Solomon Codes
In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood performance. The advantage of this decoding algorithm over previously proposed algorithms is its fast convergence in terms of the number of iterations required. This is achieved by combining two powerful soft decision decoding techniques which were previously regarded in the ...
متن کاملA Displacement Approach to Decoding Algebraic Codes
Using methods originating in numerical analysis, we will develop a uni ed framework for derivation of eÆcient algorithms for decoding several classes of algebraic codes. We will demonstrate our method by accelerating Sudan's list decoding algorithm for Reed-Solomon codes [22], its generalization to algebraic-geometric codes by Shokrollahi and Wasserman [21], and the improvement of Guruswami and...
متن کامل